Bounded computational capacity equilibrium
نویسندگان
چکیده
A celebrated result of Abreu and Rubinstein (1988) states that in repeated games, when the players are restricted to playing strategies that can be implemented by finite automata and they have lexicographic preferences, the set of equilibrium payoffs is a strict subset of the set of feasible and individually rational payoffs. In this paper we explore the limitations of this result. We prove that if memory size is costly and players can use mixed automata, then a folk theorem obtains and the set of equilibrium payoffs is once again the set of feasible and individually rational payoffs. Our result emphasizes the role of memory cost and of mixing when players have bounded computational power. © 2016 Elsevier Inc. All rights reserved. JEL classification: C72; C73
منابع مشابه
Parametric Bounded Löb's Theorem and Robust Cooperation of Bounded Agents
Löb’s theorem and Gödel’s theorems make predictions about the behavior of systems capable of self-reference with unbounded computational resources with which to write and evaluate proofs. However, in the real world, systems capable of self-reference will have limited memory and processing speed, so in this paper we introduce an effective version of Löb’s theorem which is applicable given such b...
متن کاملModeling Bounded Rationality in Capacity Allocation Games with the Quantal Response Equilibrium
We consider a supply chain with a single supplier and two retailers. The retailers choose their orders strategically, and if their orders exceed the supplier's capacity, quantities are allocated proportionally to the orders. We experimentally study the capacity allocation game using subjects motivated by financial incentives. We find that the Nash equilibrium, which assumes that players are per...
متن کاملNo-Regret with Bounded Computational Capacity
We deal with no regret and related aspects of vector-payoff games when one of the players is limited in computational capacity. We show that player 1 can almost approach with bounded-recall strategies, or with finite automata, any convex set which is approachable when no capacity bound is present. In particular we deduce that with bounded computational capacity player 1 can ensure having almost...
متن کاملNotes on Computational Uncertainties in Probabilistic Risk/Safety Assessment
In this article, we study computational uncertainties in probabilistic risk/safety assessment resulting from the computational complexity of calculations of risk indicators. We argue that the risk analyst faces the fundamental epistemic and aleatory uncertainties of risk assessment with a bounded calculation capacity, and that this bounded capacity over-determines both the design of models and ...
متن کاملExcludability and Bounded Computational Capacity
We study the notion of excludability in repeated games with vector payoffs, when one of the players is restricted to strategies with bounded computational capacity. We show that a closed set is excludable by Player 2 when Player 1 is restricted to using only bounded-recall strategies if and only if it does not contain a convex approachable set. We provide partial results when Player 1 is restri...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Economic Theory
دوره 163 شماره
صفحات -
تاریخ انتشار 2016